Characterizations of Complete Stabilizability

نویسندگان

چکیده

We present several characterizations, via some weak observability inequalities, on the complete stabilizability for a control system $[A,B]$, i.e., $y'(t)=Ay(t)+Bu(t)$, $t\geq 0$, where $A$ generates $C_0$-semigroup Hilbert space $X$ and $B$ is linear bounded operator from another $U$ to $X$. then extend aforementioned characterizations in two directions: first, unbounded; second, time periodic. also give sufficient conditions, perspective of spectral projections, ensure inequalities. As applications, we provide examples, which are not null controllable, but can be verified, completely stabilizable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Homological characterizations of quasi-complete intersections

Let R be a commutative ring, (f) an ideal of R, and E = K(f ;R) the Koszul complex. We investigate the structure of the Tate construction T associated with E. In particular, we study the relationship between the homology of T , the quasi-complete intersection property of ideals, and the complete intersection property of (local) rings.

متن کامل

On Some Characterizations of Complete Fuzzy Preorders

S. Dı́az Dept. of Statistics and O.R., Faculty of Science University of Oviedo, Calvo Sotelo s/n, 33071 Oviedo, Spain [email protected] B. De Baets Dept. of Applied Mathematics, Biometrics and Process Control Ghent University, Coupure links 653, B-9000 Gent, Belgium [email protected] S. Montes Dept. of Statistics and O.R. Nautical School, University of Oviedo, Viesques Campus, 33271 Gi...

متن کامل

Differential-geometric Characterizations of Complete Intersections

We characterize complete intersections in terms of local differential geometry. Let X ⊂ CPn+a be a variety. We first localize the problem; we give a criterion for X to be a complete intersection that is testable at any smooth point of X. We rephrase the criterion in the language of projective differential geometry and derive a sufficient condition for X to be a complete intersection that is com...

متن کامل

Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs

A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a complete multipartite digraph. Such a digraph D is called ordinary if for any pair X, Y of its partite sets the set of arcs with end vertices in X ∪ Y coincides with X × Y = {x, y) : x ∈ X, y ∈ Y } or Y ×X or X×Y ∪Y ×X. We characterize a...

متن کامل

Characterizations of complete residuated lattice-valued finite tree automata

This paper deals with the concept of complete residuated lattice-valued (referred to as L-valued) finite tree automata. In this regard, we first define an L-valued regular tree language, and then we prove a necessary and sufficient condition for the regularity of an L-valued tree language. Furthermore, we generalize the pumping lemma for L-valued finite tree automata (L-FTA). Afterwards, the be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Siam Journal on Control and Optimization

سال: 2022

ISSN: ['0363-0129', '1095-7138']

DOI: https://doi.org/10.1137/20m1386761